Distributed constrained optimization via continuous-time mirror design
نویسندگان
چکیده
منابع مشابه
Continuous-time envelope-constrained filter design via Laguerre filters and H∞ optimization methods
Envelope-constrained ltering is concerned with the design of a time-invariant lter to process a given input signal such that the noiseless output of the lter is guaranteed to lie within a prespeci ed output mask. In this paper, using Laguerre lters andH1 optimization techniques, the continuous-time envelope-constrained lter design problem has been reformulated and solved as a constrained H1 mod...
متن کاملContinuous time portfolio optimization
This paper presents dynamic portfolio model based on the Merton's optimal investment-consumption model, which combines dynamic synthetic put option using risk-free and risky assets. This paper is extended version of methodological paper published by Yuan Yao (2012). Because of the long history of the development of foreign financial market, with a variety of financial derivatives, the study on ...
متن کاملA Continuous-Time Multi-Agent Systems Based Algorithm for Constrained Distributed Optimization
This paper considers a second-order multi-agent system for solving the non-smooth convex optimization problem, where the global objective function is a sum of local convex objective functions within different bound constraints over undirected graphs. A novel distributed continuous-time optimization algorithm is designed, where each agent only has an access to its own objective function and boun...
متن کاملContinuous-Time Optimization Problems via KT-Invexity
We prove that the notion of KT-invexity for continuous-time nonlinear optimization problem is a necessary and sufficient condition for global optimality of a KarushKuhn-Tucker point.
متن کاملDistributed convex optimization via continuous-time coordination algorithms with discrete-time communication
This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is strictly convex and equal to a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Difference Equations
سال: 2018
ISSN: 1687-1847
DOI: 10.1186/s13662-018-1845-y